Experimental Study of Totally Optimal Decision Trees
نویسندگان
چکیده
منابع مشابه
Optimal Decision Trees
We propose an Extreme Point Tabu Search (EPTS) algorithm that constructs globally optimal decision trees for classiication problems. Typically, decision tree algorithms are greedy. They optimize the misclassiication error of each decision sequentially. Our non-greedy approach minimizes the misclassiication error of all the decisions in the tree concurrently. Using Global Tree Optimization (GTO)...
متن کاملTotally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization of decision trees and decision rules) to conduct experiments. We show that, for each monotone Boolean function with at most five variables, there e...
متن کاملOptimal Cascaded Hierarchies of Linguistic Decision Trees for Decision Making
For multiple attribute decision making, the underlying relationship between attributes and classification, decision or utility variable is often highly uncertain and imprecise. This requires an integrated treatment of uncertainty and fuzziness when modeling the propagation of information from low-level attributes to high-level decision variables. One of the main drawbacks to fuzzy modeling of s...
متن کاملOptimal Generalized Decision Trees via Integer Programming
Decision trees have been a very popular class of predictive models for decades due to their interpretability and good performance on categorical features. However, they are not always robust and tend to overfit the data. Additionally, if allowed to grow large, they lose interpretability. In this paper, we present a novel mixed integer programming formulation to construct optimal decision trees ...
متن کاملDecision trees with optimal joint partitioning
Decision tree methods generally suppose that the number of categories of the attribute to be predicted is fixed. Breiman et al., with their Twoing criterion in CART, considered gathering the categories of the predicted attribute into two supermodalities. In this article, we propose an extension of this method. We try to merge the categories in an optimal unspecified number of supermodalities. O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2019
ISSN: 0169-2968,1875-8681
DOI: 10.3233/fi-2019-1784